Sentential calculus for logical falsehoods.
نویسندگان
چکیده
منابع مشابه
A Logical Process Calculus
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, kPC extends Milner's Calculus of Conmmnicating Systems with operators fl'om the alternation free linear time p calculus (kT#). Semantically, kPC is equipped with a behavioral preorder that generalizes ...
متن کاملA logical calculus for polynomial-time realizability
A logical calculus, not unlike Gentzen's sequent calculus for intuitionist logic, is described which is sound for polynomial-time realizability as deened by Crossley and Remmel. The sequent calculus admits cut elimination, thus giving a decision procedure for the propositional fragment. 0 Introduction In 4], a restricted notion of realizability is introduced, a special case of which is polynomi...
متن کاملIntra-sentential context effects on the interpretation of logical metonymy
Verbs such as enjoy in the student enjoyed the book exhibit logical metonymy: enjoy is interpreted as enjoy reading. Theoretical work (Pustejovsky, 1991, 1995) predicts that this interpretation can be influenced by intra-sentential context, e.g., by the subject of enjoy. In this article, we test this prediction using a completion experiment and find that the interpretation of a metonymic verb i...
متن کاملProbabilistic Sentential Decision Diagrams:Learning with Massive Logical Constraints
We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and canonical representation of probability distributions defined over the models of a given propositional theory. Each parameter of a PSDD can be viewed as the (conditional) probability of making a decision in a corresponding Sentential Decision Diagram (SDD). The SDD itself is a recently proposed complete and canonica...
متن کاملAn Automated Derivation of Łukasiewicz's CN from Frege's Sentential Calculus
Two logics are implicationally equivalent if the axioms and inference rules of each imply the axioms of the other. Characterizing the inferential equivalences of various formulations of the sentential calculi is foundational. Using an automated deduction system, I show that Łukasiewicz's CN can be derived from Frege's Begriffsschrift, the first sentential calculus ; the proof appears to be novel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1973
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093890998